#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e2+100;
typedef long long LL;
inline LL read()
{LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL p[maxn][maxn];
LL dp[maxn][maxn];
void pre(){
    memset(p,-0x3f,sizeof(p));
    memset(dp,0x3f,sizeof(dp));
    dp[1][1]=p[1][1]=0;
    for(LL i=1;i<=100;i++){
        for(LL j=1;j<=100;j++){
             if(j==1&&i==1) continue;
             dp[i][j]=min(dp[i-1][j]+j,dp[i][j-1]+i);
             p[i][j]=max(p[i-1][j]+j,p[i][j-1]+i);
        }
    }
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   pre();
   while(t--){
      LL n,m,k;cin>>n>>m>>k;
      if(dp[n][m]<=k&&p[n][m]>=k){
         cout<<"YES"<<"\n";
      }
      else cout<<"NO"<<"\n";
   }
   return 0;
}
